The existence of uniquely -G colourable graphs

نویسندگان

  • Dimitris Achlioptas
  • Jason I. Brown
  • Derek G. Corneil
  • Michael Molloy
چکیده

Given graphs F and G and a nonnegative integer k, a function n : V(F) ~ {1 . . . . . k} is a G k-colouring of F if no induced copy of G is monochromatic; F is G k-chromatic if F has a G k-colouring but no G (k 1)-colouring. Further, we say F is uniquely G k-colourable if F is G k-chromatic and, up to a permutation of colours, it has only one G k-colouring. Such notions are extensions of the well-known corresponding definitions from chromatic theory. It was conjectured that for all graphs G of order at least two and all positive integers k there exist uniquely G k-colourable graphs, We prove the conjecture and show that, in fact, in all cases infinitely many such graphs exist.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k 12(g+1) vertices whose maximal degree is at most 5k 13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G) log jGj 13 log k and maximum degree (G) 6k 13 can exist. We also study several related problems.

متن کامل

Uniquely circular colourable and uniquely fractional colourable graphs of large girth

Given any rational numbers r ≥ r′ > 2 and an integer g, we prove that there is a graph G of girth at least g, which is uniquely circular r-colourable and uniquely fractional r′-colourable. Moreover, the graph G has maximum degree bounded by a number which depends on r and r′ but does not depend on g.

متن کامل

Solis Graphs and Uniquely Metric Basis Graphs

A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...

متن کامل

A Note on Uniquely H-colourable Graphs

For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.

متن کامل

Structures and chromaticity of some extremal 3-colourable graphs

Given a graph G and a positive integer r, let sr(G)=P(G; r)=r!. Thus (G)=r and sr(G)=1 i G is uniquely r-colourable. It is known that if G is uniquely 3-colourable, then e(G)¿2v(G)−3. In this paper, we show that if G is a 3-colourable connected graph with e(G)=2v(G)−k where k¿4, then s3(G)¿2k−3; and if, further, G is 2-connected and s3(G)=2k−3, then t(G)6v(G)−k where t(G) denotes the number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 179  شماره 

صفحات  -

تاریخ انتشار 1998